Almost opposite regression dependence in bivariate distributions
نویسندگان
چکیده
منابع مشابه
Tail dependence in bivariate skew-Normal and skew-t distributions
Quantifying dependence between extreme values is a central problem in many theoretical and applied studies. The main distinction is between asymptotically independent and asymptotically dependent extremes, with important theoretical examples of these general limiting classes being the extremal behaviour of a bivariate Normal distribution, for asymptotic independence, and of the bivariate t dist...
متن کاملCharacterizations of Probability Distributions via Bivariate Regression of Record Values
Bairamov et al. (2005) characterize the exponential distribution in terms of the regression of a function of a record value with its adjacent record values as covariates. We extend these results to the case of nonadjacent covariates. We also consider a more general setting involving monotone transformations. As special cases, we present characterizations involving weighted arithmetic, geometric...
متن کاملAsymmetric Univariate and Bivariate Laplace and Generalized Laplace Distributions
Alternative specifications of univariate asymmetric Laplace models are described and investigated. A more general mixture model is then introduced. Bivariate extensions of these models are discussed in some detail, with particular emphasis on associated parameter estimation strategies. Multivariate versions of the models are briefly introduced.
متن کاملModeling with Bivariate Geometric Distributions
We study systems with several components which are subject to different types of failures. Examples of such systems include twin engines of an airplane or the paired organs in a human body. We find that such a system, using conditional arguments, can be characterized as multivariate geometric distributions. We prove that the characterizations of the geometric model can be achieved using conditi...
متن کاملBivariate Complexity Analysis of Almost Forest Deletion
In this paper we study a generalization of classic Feedback Vertex Set problem in the realm of multivariate complexity analysis. We say that a graph F is l-forest if we can delete l edges from F to get a forest. That is, F is l edges away from being a forest. In this paper we introduce the Almost Forest Deletion problem. In this problem given a graph G and integers k and l, the question is whet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Papers
سال: 2014
ISSN: 0932-5026,1613-9798
DOI: 10.1007/s00362-014-0622-6